Contribution à la modélisation et à la vérification de processus workflow

Work ow technology, whose role is to automate business processes and to provide a support for their management, is today an active sector of research. This thesis deals with the modelling of the work ow processes and their analysis. These processes, probably constrained by shared resources or by durations of treatment, must be checked before being executed by their work ow management systems. In this direction, we were interested by the checking of the soundness property of work ow nets (WF-nets) : subclasses of Petri nets modelling the work ow processes. To begin with, by exploring the structure theory of Petri nets, we have identi ed subclasses of WF-nets for which soundness can be checked and characterized e ectively. We also extended these subclasses by taking account of the presence of shared resources and we focused on the soundness property in the presence of an arbitrary number of instances ready to be carried out. In this part, we had to automate the computation of minimal siphons in a Petri net. For that, we chose an algorithm of the literature and improved it by the research and the contraction of alternate circuits. Then, we were concerned by the modelling and the analysis of work ow processes holding temporal constraints. We initially proposed the model of TWF-net (Timed WFnet). For this model, we de ned its soundness and proposed a method to check it. Then, we released the adopted temporal constraints by the proposal of a model covering work ow processes for witch temporal constraints vary in time intervals. We formally de ned the model of ITWF-net (Interval Timed WF-net) and gave its semantics. In addition, we developed and tested a prototype of modelling and simulation of ITWF-nets. The last part of this thesis concerns the formal analysis of work ow processes with SPIN model checker. We initially translated the work ow speci cation into Promela : the model description language used by SPIN. Then, we expressed the soundness properties in Linear Temporal Logic (LTL) and used SPIN to test if each property is satis ed by the Promela model of a given WF-net. Moreover, we expressed the properties of k-soundness for WFnets modelling several instances and (k,R)-soundness for competitive work ow processes which share resources.